Privacy in Statistical Databases %2D UNESCO Chair in Data Privacy

Ad hoc broadcast encryption.

Identity%2DBased Authenticated Asymmetric Group Key Agreement Protocol.

Threshold Public%2DKey Encryption with Adaptive Security and Short Ciphertexts.

Rational Privacy Disclosure in Social Networks.

User Privacy in Web Search.
I am deeply grateful to my advisors, Dr. Ziv Bar-Yossef and Prof. Idit Keidar, for dedicated guidance, encouragement, and patience throughout the years. I was tremendously enlightened by our discussions and enjoyed them. I highly appreciate the fortune of having the chance to work with you.
A Bibliometric Index Based on Collaboration Distances.

Coprivacy Towards a Theory of Sustainable Privacy.

Privacy%2Dpreserving publication of trajectories using microaggregation.

From t%2DCloseness%2DLike Privacy to Postrandomization via Information Theory.

Hybrid microdata using microaggregation.

Simulatable certificateless two%2Dparty authenticated key agreement protocol.

Weighted network decapitation the economics of iterated attack and defense.

The UNESCO Chair in Data Privacy Research in Vehicular Networks.

Asymmetric Group Key Agreement.

Safety and Privacy in Vehicular Communications.
Abstract. Vehicular ad hoc networks (VANETs) allow vehicles to disseminate messages about road conditions to other vehicles. As long as these messages are trustworthy, they can greatly increase traffic safety and efficiency. Hence, care must be exerted to ensure that vehicle-generated messages do not convey inaccurate or false content. A natural way to proceed is to request endorsement by nearby vehicles on the content of a message originated by a certain vehicle. However, such a message generation and peer-to-peer endorsement should not result in any privacy loss on the part of vehicles co-operating in it. We survey the available solutions to this security-privacy tension and discuss their limitations. We sketch a new privacy-preserving system which guarantees message authentication through both a priori and a posteriori countermeasures. 1
The Functionality%2DSecurity%2DPrivacy Game.

Safety and Privacy in Vehicular Communications.
Abstract. Vehicular ad hoc networks (VANETs) allow vehicles to disseminate messages about road conditions to other vehicles. As long as these messages are trustworthy, they can greatly increase traffic safety and efficiency. Hence, care must be exerted to ensure that vehicle-generated messages do not convey inaccurate or false content. A natural way to proceed is to request endorsement by nearby vehicles on the content of a message originated by a certain vehicle. However, such a message generation and peer-to-peer endorsement should not result in any privacy loss on the part of vehicles co-operating in it. We survey the available solutions to this security-privacy tension and discuss their limitations. We sketch a new privacy-preserving system which guarantees message authentication through both a priori and a posteriori countermeasures. 1
Aggregation of Trustworthy Announcement Messages in Vehicular Ad Hoc Networks.

Inference Control in Statistical Databases.
Inference control in statistical databases is a discipline with  several other names, such as statistical disclosure control, statistical disclosure  limitation, or statistical database  protection.R  egardless of the  name used, current work in this very active field is rooted in the work  that was started on statistical database protection in the 70s and 80s.
Information Loss Measures.

k%2DAnonymity.
When a database owner needs to disclose her data, she can k-anonymize her data to protect the involved individuals’ privacy. However, if the data is distributed between two owners, then it is an open question whether the two owners can jointly k-anonymize the union of their data, such that the information suppressed in one owner’s data is not revealed to the other owner. In this paper, we study this problem of distributed k-anonymization. We have two major results: First, it is impossible to design an unconditionally private protocol that implements any normal k-anonymization function, where normal k-anonymization functions are a very broad class of kanonymization functions, including the k-anonymization functions implemented by all existing k-anonymization algorithms. Second, we give an efficent protocol that implements a normal kanonymization function and show that it is private against polynomial-time adversaries. This protocol is ID-based, which means the two data owners don’t need to have a priori knowledge of each other’s public key. Our results have many potential applications and can be extended to three or more parties. 
Microdata.
Governmental, public, and private organizations are more and more frequently required to make data available for external release in a selective and secure fashion. Most data are today released in the form of microdata, reporting information on individual respondents. The protection of microdata against improper disclosure is therefore an issue that has become increasingly important and will continue to be so. This has created an increasing demand on organizations to devote resources for adequate protection of microdata. In this chapter, we first characterize the microdata protection problem (in contrast to macrodata protection), discussing the disclosure risks at which microdata are exposed. We survey the main techniques that have been proposed to protect microdata from improper disclosure by distinguishing them in masking techniques (which protect data by masking or perturbing their values), and synthetic data generation techniques (which protect data by replacing them with plausible, but made up, values). We conclude the chapter with observations on measures for assessing disclosure risk and information loss brought by the application of protection techniques. 1
Microaggregation.
Microaggregation is a statistical disclosure control technique for microdata.
Microdata Rounding.

Noise Addition.
Noise addition is a family of methods used in the protection  of the privacy of individual data (microdata) in statistical databases.
Non%2DPerturbative Masking Methods.

PRAM.
Various alternatives to the PRAM model have been proposed in recent literature. This paper defines the notion of cost consistency, and shows that many previous PRAM-type models lack this important attribute. An alternative model of parallel computation, called the Parameterized PRAM, is then introduced. This model is shown to be fully general, in the sense that many other PRAM models may be defined in term of the P-PRAM. The P-PRAM is then shown to be a useful tool in parallel algorithm design, due to its inherent cost consistency, and various P-PRAM algorithms are presented and analyzed. 1 Introduction  The PRAM has become a widely accepted model of parallel computation. It is a shared memory model, where all processors operate synchronously (though not necessarily in SIMD mode). It has proven to be an easy platform on which to design algorithms (see [16] for a survey of PRAM algorithms). PRAM algorithms consist of a set of threads. In each step each thread performs one of the followi...
Record Linkage.
INTRODUCTION  Matching has a long history of uses in statistical surveys and administrative data development. A business register consisting of names, addresses, and other identifying information such as total financial receipts might be constructed from tax and employment data bases (see chapters by Colledge, Nijhowne, and Archer). A survey of retail establishments or agricultural establishments might combine results from an area frame and a list frame. To produce a combined estimator, units from the area frame would need to be identified in the list frame (see Vogel-Kott chapter). To estimate the size of a (sub)population via capture-recapture techniques, one needs to accurately determine units common to two or more independent listings (Sekar and Deming 1949; Scheuren 1983; Winkler 1989b). Samples must be drawn appropriately to estimate overlap (Deming and Gleser 1959).  Rather than develop a special survey to collect data for policy decisions, it might be more appropriate t
Record Matching.
Data Quality has many dimensions one of which is accuracy. Accuracy is usually compromised by errors accidentally or intensionally introduced in a database system. These errors result in inconsistent, incomplete, or erroneous data elements. For example, a small variation in the representation of a data object, produces a unique instantiation of the object being represented. In order to improve the accuracy of the data stored in a database system, we need to compare them either with real-world counterparts or with other data stored in the same or a different system. In this paper we address the problem of matching records which refer to the same entity by computing their similarity. Exact record matching has limited applicability in this context since even simple errors like character transpositions cannot be captured in the record linking process. Our methodology deploys advanced data mining techniques for dealing with the high computational and inferential complexity of approximate record matching.
SDC Score.
We have developed a new computer algorithm for determining the backbone resonance assignments for biopolymers. The approach we have taken, relative hypothesis prioritization, is implemented as a Lua program interfaced to the recently developed computer-aided resonance assignment (CARA) program. Our program can work with virtually any spectrum type, and is especially good with NOESY data. The results of the program are displayed in an easy-to-read, color-coded, graphic representation, allowing users to assess the quality of the results in minutes. Here we report the application of the program to two RNA recognition motifs of Apobec-1 Complementation Factor. The assignment of these domains demonstrates AutoLinkÕs ability to deliver accurate resonance assignments from very minimal data and with minimal user intervention.
Synthetic Microdata.
Generation of a synthetic microdata set that reproduces the  statistical properties of an original microdata set is a promising approach  to statistical disclosure control (SDC) of microdata. In this paper, a new  method for generating continuous synthetic microdata is proposed. The  covariance matrix and the univariate statistics of the original data set  are exactly preserved. The method is non-iterative and its complexity  grows linearly with the number of records to be protected.
Tabular Data.
We describe two classes of software systems that release tabular summaries of an underlying  database. Table servers respond to user queries for (marginal) sub-tables of the &#034;full&#034; table  summarizing the entire database, and are characterized by dynamic assessment of disclosure  risk, in light of previously answered queries. Optimal tabular releases are static releases of  sets of sub-tables that are characterized by maximizing the amount of information released,  as given by a measure of data utility, subject to a constraint on disclosure risk. Underlying  abstractions --- primarily associated with the query space, as well as released and unreleasable  sub-tables and frontiers, computational algorithms and issues, especially scalability, and prototype  software implementations are discussed.
Data Rank%2FSwapping.
this paper we became aware that another paper to this conference (paper no. 5) also described rank swapping with the same term and with reference to an unpublished paper by Moore (1996). 7. Experimenting with rank matching and rank swapping on the real survey is an ongoing project that we had hoped would be brought so far that we could publish interesting results in this paper. For practical reasons this has not been possible. However, the basic ideas, some theory and simulation results comparing the two methods are presented. Comparison with other methods will be given in later papers. A description of the real data that entered our disclosure experiment and on which we are still working on is given in section II. II. DESCRIPTION OF THE DATA  8. We used the 1997 version of SLC, which consists of 3363 primary respondents from a national sample. The primary respondents answered the survey questionnaire. The questionnaire contained both questions affecting only the primary respondents and questions concerning his or her household. In addition to the primary respondents, all other household members were mapped and fully identified in the interview. They will be termed the secondary respondents. Demographic variables, register information on education, the income tax return and several kinds of economic transfers like for instance family allowance, disablement benefits and social security were linked to all secondary as well as primary respondents in the survey. The income tax returns were edited to reflect welfare-oriented income. Not every detail in the original income tax returns was kept in the final survey dataset. It was not, based on the survey-data, possible to recalculate the original assessment data with certainty from the survey. The variables central to matching...
Disclosure Risk.

On reliability indices of communication networks.


Recent progress in database privacy.


Erratum to %22A measure of variance for hierarchical nominal attributes%22.
This paper presents an overview of pattern clustering methods from a statistical pattern recognition perspective, with a goal of providing useful advice and references to fundamental concepts accessible to the broad community of clustering practitioners. We present a taxonomy of clustering techniques, and identify cross-cutting themes and recent advances. We also describe some important applications of clustering algorithms such as image segmentation, object recognition, and information retrieval
h%28k%29%2Dprivate information retrieval from privacy%2Duncooperative queryable databases.%22g%3B%28k%29%2Dprivate infmatio retrieval from privacy%2Duncooperative queryable databases.

Privacy in Statistical Databases
We show that the need to maintain privacy in statistical databases  naturally leads to interval computations, and provide feasible algorithms  for the corresponding interval computation problems.
A Critique of k%2DAnonymity and Some of Its Enhancements.

A Shared Steganographic File System with Error Correction.

Location privacy via unlinkability an alternative to cloaking and perturbation.
While the ever increasing computational power together with the huge amount of individual data collected daily by various agencies is of great value for our society, they also pose a significant threat to individual
Micro%2Daggregation%2Dbased heuristics for p%2Dsensitive k%2Danonymity one step beyond.
Micro-data protection is a hot topic in the field of Statistical Disclosure Control (SDC), that has gained special interest after the disclosure of 658000 queries by the AOL search engine in August 2006. Many algorithms, methods and properties have been proposed to deal with micro-data disclosure. p-Sensitive k-anonymity has been recently defined as a sophistication of k-anonymity. This new property requires that there be at least p different values for each confidential attribute within the records sharing a combination of key attributes. Like k-anonymity, the algorithm originally proposed to achieve this property was based on generalisations and suppressions; when data sets are numerical this has several data utility problems, namely turning numerical key attributes into categorical, injecting new categories, injecting missing data, and so on. In this article, we recall the foundational concepts of micro-aggregation, k-anonymity and p-sensitive k-anonymity. We show that k-anonymity and p-sensitive k-anonymity can be achieved in numerical data sets by means of micro-aggregation heuristics properly adapted to deal with this task. In addition, we present and evaluate two heuristics for p-sensitive k-anonymity which, being based on micro-aggregation, overcome most of the drawbacks resulting from the generalisation and suppression method.
Invited Talk Extended Abstract Safety and Privacy in Vehicular Communications.
Copyright c○2008 for the individual papers by the papers ’ authors. Copying permitted for private and academic purposes. Re-publication of material from this volume requires permission by the copyright owners. Preface Location based applications in travel, logistics, health care, social networks and other industries already exist and are poised to proliferate. One of the critical issues for a widespread deployment of these applications is how to conciliate their effectiveness and quality with privacy concerns. The PiLBA ’08 workshop was intended to bring together scientists from security and data management to discuss the most recent advances in the field. These proceedings include the eight contributions on this topic selected from the submissions by the PC chairs with the help of the members of the program committee, and presented at the workshop. They include an extended abstract of the invited talk, two survey papers, and five research papers covering several complementary aspects of privacy in location based applications and services. The Organizing Committee would like to thank all the people that supported and helped in the organization of this event. A particular acknowledgment to the PC members, to Javier
Location Privacy in Location%2DBased Services Beyond TTP%2Dbased Schemes.
Abstract. Location-Based Services (LBS) are gaining importance due to the advances in mobile networks and positioning technologies. Nevertheless, the wide deployment of LBS can jeopardise the privacy of their users, so ensuring user privacy is paramount to the success of those services. This article surveys the most relevant techniques for guaranteeing location privacy to LBS users. The rigid dichotomy between schemes which rely on Trusted Third Parties (TTP-based) and those which do not (TTP-free) is emphasised. Also, the convenience of both approaches is discussed and some ideas on the future of location privacy in these services are sketched. Keywords: Anonymisation/pseudonymisation in LBS, Trust management in LBS.
From t%2DCloseness to PRAM and Noise Addition Via Information Theory.

Peer%2Dto%2DPeer Private Information Retrieval.

An Anonymity Model Achievable Via Microaggregation.

Statistical Databases.

Secure and scalable many%2Dto%2Done symbol transmission for sensor networks.

Privacy homomorphisms for social networks with private relationships.

A polynomial%2Dtime approximation to optimal multivariate microaggregation.

Efficient Remote Data Possession Checking in Critical Information Infrastructures.

A measure of variance for hierarchical nominal attributes.

On Overlappings of Digitized Straight Lines and Shared Steganographic File Systems.

Editorial.
calls &amp; calendarEDITORIAL
On Overlappings of Digitized Straight Lines and Shared Steganographic File Systems.

On Partial Anonymity in Secret Sharing.

A Genetic Approach to Multivariate Microaggregation for Database Privacy.

Secure and Private Incentive%2DBased Advertisement Dissemination in Mobile Ad Hoc Networks.

An Incentive%2DBased System for Information Providers over Peer%2Dto%2DPeer Mobile Ad%2DHoc Networks.

A Public%2DKey Protocol for Social Networks with Private Relationships.

An Incentive%2DBased System for Information Providers over Peer%2Dto%2DPeer Mobile Ad%2DHoc Networks.

A Three%2DDimensional Conceptual Framework for Database Privacy.

Scalability and security in biased many%2Dto%2Done communication.


Advances in smart cards.
Over the last twenty years, the software in smart cards has  radically changed. This has happened for several reasons, smart card  software was initially rigid and monolithic and has now become more  flexible with a clear separation between &#034;operating system level&#034; and  &#034;application level&#034; parts. What is more, application-level resources are  now much more accessible (nearly to end user level). Nevertheless, smart  cards have evolved separately from an ever more distributed &#034;outside  world&#034;. This paper presents two contributions to next-generation smart  card operating systems. The first, called CAMILLE, relies on the exokernel  approach to obtain extensibility, without compromising security,  raising making operating systems accessible to application designers. The  second, called AWARE, reveals the mismatch between the smart card  execution model and the role it is expected to play in distributed systems.
A distributed architecture for scalable private RFID tag identification.
identification

Modeling Decisions for Artificial Intelligence
Abstract — Fuzzy queries addressed to a relational database management system are based on the expression of user preferences which leads to obtain more appropriate answers. Fuzzy set theory provides powerful tools to define such conditions (fuzzy conditions). In this context, it is possible to consider fuzzy bipolar conditions which are made of two fuzzy sets to describe user&#039;s preferences: i) a fuzzy constraint to represent a mandatory requirement, ii) a fuzzy wish to represent an optional requirement. A Fuzzy constraint is mandatory in the sense that it must be fulfilled (and it can be used to discard elements). A fuzzy wish is optional since it cannot be used to discard elements (but its satisfaction brings a bonification). This paper is devoted to the aggregation of fuzzy bipolar conditions and to the definition of extended norms and co-norms.
Smart Card Research and Advanced Applications
This contribution describes how an elliptic curve cryptosystem can be implemented on very low cost microprocessors with reasonable performance. We focus in this paper on the Intel 8051 family of microcontrollers popular in smart cards and other cost-sensitive devices. The implementation is based on the use of the finite field GF ((2  8  -  17)  17  ) which is particularly suited for low end 8-bit processors. Two advantages of our method are that subfield modular reduction can be performed infrequently, and that an adaption of Itoh and Tsujii&#039;s inversion algorithm is used for the group operation. We show that an elliptic curve scalar multiplication with a fixed point, which is the core operation for a signature generation, can be performed in a group of order approximately 2  134  in less than 2 seconds. Unlike other implementations, we do not make use of curves defined  over a subfield such as Koblitz curves.  1  2  Keywords: finite fields, fast arithmetic, Optimal Extension Fields, mo...
A Smart Card%2DBased Mental Poker System.

Privacy in Statistical Databases
We show that the need to maintain privacy in statistical databases  naturally leads to interval computations, and provide feasible algorithms  for the corresponding interval computation problems.
A 2d%2DTree%2DBased Blocking Method for Microaggregating Very Large Data Sets.

A Smart Card%2DBased Mental Poker System.

Privacy in Statistical Databases k%2DAnonymity Through Microaggregation.

Privacy homomorphisms for e%2Dgambling and mental poker.

On the Security of a Repaired Mental Poker Protocol.

Watermarking Non%2Dnumerical Databases.

Microaggregation for Database and Location Privacy.


Optimal Multivariate 2%2DMicroaggregation for Microdata Protection A 2%2DApproximation.


Regression for ordinal variables without underlying continuous variables.

Watermarking Numerical Data in the Presence of Noise.

Efficient multivariate data%2Doriented microaggregation.

Feature Selection and Outliers Detection with Genetic Algorithms and Neural Networks.

Noise%2DRobust Watermarking for Numerical Datasets.

Dropout%2DTolerant TTP%2DFree Mental Poker.
Abstract. There is a broad literature on distributed card games over communications networks, collectively known as mental poker. Likein any distributed protocol, avoiding the need for a Trusted Third Party (TTP) in mental poker is highly desirable, because really trusted TTPs are not always available and seldom free. This paper deals with the player dropout problem in mental poker without a TTP. A solution based on zero-knowledge proofs is proposed. While staying TTP-free, our proposal allows the game to continue after player dropout.
Privacy in Data Mining.
Privacy has been identified as a vital requirement in designing and implementing data mining systems. In general, privacy preservation in data mining demands protecting both input and output privacy: the former refers to sanitizing the raw data itself before performing mining; while the latter refers to preventing the mining output (models or patterns) from malicious inference attacks. This paper presents a systematic study on the problem of protecting output privacy in data mining, and particularly, stream mining: (i) we highlight the importance of this problem by showing that even sufficient protection of input privacy does not guarantee that of output privacy; (ii) we present a general inferencing and disclosure model that exploits the intra-window and inter-window privacy breaches in stream mining output; (iii) we propose a light-weighted countermeasure that effectively eliminates these breaches without explicitly detecting them, while minimizing the loss of output accuracy; (iv) we further optimize the basic scheme by taking account of two types of semantic constraints, aiming at maximally preserving utility-related semantics while maintaining hard privacy guarantee; (v) finally, we conduct extensive experimental evaluation over both synthetic and real data to validate the efficacy of our approach.
Probabilistic Information Loss Measures in Confidentiality Protection of Continuous Microdata.

Ordinal
Summary. We present the choice function rule in the beginning of the article. In the main part of the article we formalize the base of cardinal theory. In the first section we introduce the concept of cardinal numbers and order relations between them. We present here Cantor-Bernstein theorem and other properties of order relation of cardinals. In the second section we show that every set has cardinal number equipotence to it. We introduce notion of alephs and we deal with the concept of finite set. At the end of the article we show two schemes of cardinal induction. Some definitions are based on [9] and [10].
Privacy in Statistical Databases CASC Project International Workshop
Title 13, U.S.C., Section 9 and the newly adopted CIPSEA of 2002 impose heavy financial fines and prison penalties for a public disclosure of sensitive statistical information. Currently, complementary cell suppression procedures are mostly used by statistical agencies to protect sensitive tabular data from disclosure. It is generally believed that the linear programming (LP) based complementary cell suppression procedures offer the best protection from wrongful disclosure of statistical
On the Synergy Between Certificate Verification Trees and PayTree%2Dlike Micropayments.

Secure Many%2Dto%2DOne Transmission of q%2Dary Symbols.
There is a number of applications requiring a community of many senders to transmit some real-time information to a single receiver. Using unicast connections...
Computer Skills Training to %28Middle%2Daged%29 Adults Problems and Program.

Secure Large%2DScale Bingo.

A Non%2DRepudiable Bitstring Commitment Scheme Based on a Public%2DKey Cryptosystem.
Commitment schemes are building blocks for guaranteeing fairness in higher-level cryptographic protocols such as mental poker protocols and others. A party Alice commits to a value v (a bit or a bitstring) without revealing it. Alice should not be able to cheat by opening the commitment as   v nor to deny having committed at all. Most commitment schemes in the literature rely on hash functions, which should be strongly collision-free for the scheme to be secure. Yet collision-freeness can only be empirically checked and cannot be met with total certainty. We present a commitment scheme which avoids hash functions by using a public-key cryptosystem instead.
On the Security of an Efficient TTP%2DFree Mental Poker Protocol.
Using commutative cryptosystems is a way to obtain efficient mental poker protocols which do not require using a Trusted Third Party (TTP). However, the security of such protocols depends on the particular cryptosystem used. We show that a TTP-free mental poker protocol using an ElGamal-like commutative cryptosystem is insecure. Keywords: Mental poker, E-gambling, Cryptographic protocols without Trusted Third Party (TTP).
Secure Reverse Communication in a Multicast Tree.
Multicastcontentdeliverycanbeexpectedtobecomeamajorsourceofrevenuewiththeincreaseofprivatebroadbandfixedand  mobilecommunications.Severalmulticastapplicationsrequirethe receiverstosecurelysendsomereal  -timeinformationbacktothesource,  which leadstoamany-to-onecommunication scenario. Using unicast  connectionstosendthisreversetra#cresultsinadataimplosionwhich  mayswampthesourcewithincomingcommunication.Inordertoavoid  thisproblem,amethodforaggregatingtheinformationasitisbeing  sentbacktothesourceispresentedinthispaper.Confidentialityand  authenticationareguaranteedatthesymbollevelforthisreverserealtimetra  #c.
Object Positioning Based on Partial Preferences.
In several situations, a set of objects must be positioned  based on the preferences of a set of individuals. Sometimes, each individual  can/does only include a limited subset of objects in his preferences  (partial preferences). We present an approach whereby a matrix of distances  between objects can be derived based on the partial preferences  expressed by individuals on those objects. In this way, the similarities  and di#erences between the various objects can subsequently be analyzed.
Secure Reverse Communication in a Multicast Tree.
Multicastcontentdeliverycanbeexpectedtobecomeamajorsourceofrevenuewiththeincreaseofprivatebroadbandfixedand  mobilecommunications.Severalmulticastapplicationsrequirethe receiverstosecurelysendsomereal  -timeinformationbacktothesource,  which leadstoamany-to-onecommunication scenario. Using unicast  connectionstosendthisreversetra#cresultsinadataimplosionwhich  mayswampthesourcewithincomingcommunication.Inordertoavoid  thisproblem,amethodforaggregatingtheinformationasitisbeing  sentbacktothesourceispresentedinthispaper.Confidentialityand  authenticationareguaranteedatthesymbollevelforthisreverserealtimetra  #c.
On the Security of Noise Addition for Privacy in Statistical Databases.
Noise addition is a family of methods used in the protection  of the privacy of individual data (microdata) in statistical databases.
Outlier Protection in Continuous Microdata Masking.

Fast Generation of Accurate Synthetic Microdata.
Generation of a synthetic microdata set that reproduces the  statistical properties of an original microdata set is a promising approach  to statistical disclosure control (SDC) of microdata. In this paper, a new  method for generating continuous synthetic microdata is proposed. The  covariance matrix and the univariate statistics of the original data set  are exactly preserved. The method is non-iterative and its complexity  grows linearly with the number of records to be protected.
Large%2DScale Pay%2DAs%2DYou%2DWatch for Unicast and Multicast Communications.


Selecting Potentially Relevant Records Using Re%2Didentification Methods.

Practical Asymmetric Fingerprinting with a TTP.
Fingerprinting schemes allow tracing of illegally redistributed multimedia contents. When using asymmetric fingerprinting, the merchant does not know the marked copy nor the embedded mark, so fraudulent distribution of the content by the merchant --which could lead to framing honest customers-- is not possible. A problem with the deployment of classical asymmetric fingerprinting protocols is that they are based on information transfer methods whose implementation is di#cult, if not infeasible.
Practical Mental Poker Without a TTP Based on Homomorphic Encryption.
A solution for obtaining impartial random values in on-line gambling is presented in this paper. Unlike most previous proposals, our method does not require any TTP and allows e-gambling to reach standards of fairness, security an auditability similar to those common in physical gambling. Although our solution is detailed here for the particular case of games with reversed cards (e.g. poker), it can be easily adapted for games with open cards (e.g. blackjack) and for random draw games (e.g. keno). Thanks to the use of permutations of homomorphically encrypted cards, the protocols described have moderate computational requirements. Keywords: Mental poker, E-gambling, Privacy homomorphisms.

MINPAY a Multi%2Ddevice INternet PAY%2Das%2Dyou%2Dwatch system.

Collusion%2Dsecure and cost%2Deffective detection of unlawful multimedia redistribution.
Intellectual property protection of multimedia content is essential to the successful deployment of Internet content delivery platforms. There are two general approaches to multimedia copy protection: copy prevention and copy detection. Past experience shows that only copy detection based on mark embedding techniques looks promising. Multimedia fingerprinting means embedding a different buyer-identifying mark in each copy of the multimedia content being sold. Fingerprinting is subject to collusion attacks: a coalition of buyers collude and follow some strategy to mix their copies with the aim of obtaining a mixture from which none of their identifying marks can be retrieved; if their strategy is successful, the colluders can redistribute the mixture with impunity. A construction is presented in this paper to obtain fingerprinting codes for copyright protection which survive any collusion strategy involving up to three buyers (3-security). It is shown that the proposed scheme achieves 3-security with a codeword length dramatically shorter than the one required by the general Boneh-Shaw construction. Thus the proposed fingerprints require much less embedding capacity. Due to their own clandestine nature, collusions tend to involve a small number of buyers, so that there is plenty of use for codes providing cost-effective protection against collusions of size up to three.
On the connections between statistical disclosure control for microdata and some artificial intelligence tools.
Statistical disclosure control (SDC) and artificial intelligence (AI) use similar tools for di#erent purposes. This workdescribx the common elements ofb1q areas to increase their synergy.
Median%2Dbased aggregation operators for prototype construction in ordinal scales.
This article studies aggregation operators in ordinal scales for their application to clustering (more specifically, to microaggregation for statistical disclosure risk). In particular, we consider these operators in the process of prototype construction. This study analyzes main aggregation operators for ordinal scales [plurality rule, medians, Sugeno integrals (SI), and ordinal weighted means (OWM), among others] and shows the difficulties for their application in this particular setting. Then, we propose two approaches to solve the drawbacks and we study their properties. Special emphasis is given to the study of monotonicity because the operator is proven nonsatisfactory for this property. Exhaustive empirical work shows that in most practical situations, this cannot be considered a problem. 2003 Wiley Periodicals, Inc
Semantic%2Dbased aggregation for statistical disclosure control.

Fuzzy Microaggregation for Microdata Protection.

Disclosure risk assessment in statistical microdata protection via advanced record linkage.
This  paper reviews conventional record linkage, which assumes shared variables between the external and  the protected data sets, and then shows that record linkage---and thus disclosure---is still possible  without shared variables
Inference Control in Statistical Databases%2C From Theory to Practice

Short 3%2DSecure Fingerprinting Codes for Copyright Protection.
AconskPwkj&#034;# is pres ted to obtain3-sinPW fingerprinting codes for copyright protection.Resection agains collusion of up to three buyers is achieved with a codeword length dramaticallysramat than the one required by the general Boneh-ShawconsjPwkFIzF Thus the prop osp fingerprints require muchles embedding capacity. Due to their veryclandesPwk nature,collusFOz tend to involve asW&#034;k number of buyerss that thereis plenty of us for codes providingcosgPW&#034;&#034;OOP e protectionagains collusion ofsPF up to 3.
MICROCAST Smart Card Based %28Micro%29Pay%2Dper%2DView for Multicast Services.
With the increased availability of broadband fixed and mobile communications, multicast content delivery can be expected to become a very important market. Especially for wireless multicast delivery, it is important that payment collection be fine-grain: the customer should pay only for the content that she actually consumes. This can be achieved by using pay-per-view based on micropayments. This paper proposes the first method for enabling pay-as-youwatch services in a multicast content delivery environment. On the customer&#039;s side, micropayment generation is implemented in a smart card which can be plugged into the customer&#039;s receiving device (computer, digital video receiver, PDA, mobile phone, etc.). Micropayment collection and verification are distributed among multicast routers, which avoids bottlenecks inherent to many-to-one payment transmission.
Validating Distance%2DBased Record Linkage with Probabilistic Record Linkage.

STREAMOBILE Pay%2Dper%2DView Video Streaming to Mobile Devices Over the Internet.

A Provably Secure Additive and Multiplicative Privacy Homomorphism.
Privacy homomorphisfl (PHs are encryptiontranspti mations mapping asI of operations on cleartext to anotherso of operations on ciphertext. If additionis one of the ciphertext operations then ithas been sn wn that a PH is insWHI agains a chosSbcwHWHjs attack. Thus a PH allowing full arithmetic on encrypted data can be at bes sjSH agains known-cleartext attacks WepresI t one se h PH (none was known s far) which can be provensbj)b agains known-cleartext attacks as longas the ciphertextsiph is much larger than the cleartextseart Someapplications to delegation ofsw)wHw e computing and data and to e-gambling are briefly outlined.
Invertible Spread%2DSpectrum Watermarking for Image Authentication and Multilevel Access to Precision%2DCritical Watermarked Images.
this paper a spread-spectrum  invertiblew  atermarking systemw hich can be used to authenticate images in any lossless format, i.e. establish their integrity. A second application of invertible w termarking is multilevel access  tow  atermarked images: depending on her clearance, the image user can &#034;clean&#034; the marks of more or less parts of the image, so as to gain in precision. Both applications make sense for precision-critical images (e.g military, satellite, medical, quality control, reverse engineering images) w  hose copyright should still be protected to some extent
Enhancing Watermark Robustness through Mixture of Watermarked Digital Objects.

Advances in Inference Control in Statistical Databases An Overview.
Inference control in statistical databases is a discipline with  several other names, such as statistical disclosure control, statistical disclosure  limitation, or statistical database  protection.R  egardless of the  name used, current work in this very active field is rooted in the work  that was started on statistical database protection in the 70s and 80s.
LHS%2DBased Hybrid Microdata vs Rank Swapping and Microaggregation for Numeric Microdata Protection.
Inference control in statistical databases is a discipline with  several other names, such as statistical disclosure control, statistical disclosure  limitation, or statistical database  protection.R  egardless of the  name used, current work in this very active field is rooted in the work  that was started on statistical database protection in the 70s and 80s.
Post%2DMasking Optimization of the Tradeoff between Information Loss and Disclosure Risk in Masked Microdata Sets.
Inference control in statistical databases is a discipline with  several other names, such as statistical disclosure control, statistical disclosure  limitation, or statistical database  protection.R  egardless of the  name used, current work in this very active field is rooted in the work  that was started on statistical database protection in the 70s and 80s.
Information%2DTheoretic Disclosure Risk Measures in Statistical Disclosure Control of Tabular Data.
Statistical database protection is a part of information security which tries to prevent published statistical information (tables, individual records) from disclosing the contribution of specific respondents. This paper shows how to use information-theoretic concepts to measure disclosure risk for tabular data. The proposed disclosure risk measure is compatible with a broad class of disclosure protection methods and can be extended for computing disclosure risk for a set of linked tables.
Practical Data%2DOriented Microaggregation for Statistical Disclosure Control.

Editorial Trends in Aggregation and Security Assessment for Inference Control in Statistical Databases.

On the Security of Microaggregation with Individual Ranking Analytical Attacks.
Microaggregation is a statistical disclosure control technique.
A Critique of the Sensitivity Rules Usually Employed for Statistical Table Protection.
this paper, we construct  general counterexamples which show that none of the above rules does adequately reflect  disclosure risk if cell contributors or coalitions of them behave as intruders: in that case,  releasing a cell declared non-sensitive can imply higher disclosure risk than releasing  a cell declared sensitive. As possible solutions, we propose an alternative sensitivity  rule based on the concentration of relative contributions. More generally, we suggest  to complement a priori risk assessment based on sensitivity rules with a posteriori risk  assessment which takes into account tables after they have been protected
A Critique of the Sensitivity Rules Usually Employed for Statistical Table Protection.
this paper, we construct  general counterexamples which show that none of the above rules does adequately reflect  disclosure risk if cell contributors or coalitions of them behave as intruders: in that case,  releasing a cell declared non-sensitive can imply higher disclosure risk than releasing  a cell declared sensitive. As possible solutions, we propose an alternative sensitivity  rule based on the concentration of relative contributions. More generally, we suggest  to complement a priori risk assessment based on sensitivity rules with a posteriori risk  assessment which takes into account tables after they have been protected
Asynchronous Large%2DScale Certification Based on Certificate Verification Trees.
Good public-key infrastructures (PKIs) are essential to make electronic commerce secure. Quite recently, certificate verification trees (CVTs) have been introduced as a tool for implementation of large-scale certification authorities (CAs). In most aspects, the CVT approach outperforms previous approaches like X.509 and certificate revocation lists, SDSI/SPKI, certificate revocation trees, etc. However, there is a tradeo # between manageability for the CA and response time for the user: CVT-based certification as initially proposed is synchronous, i.e. certificates are only issued and revoked at the end of a CVT update period (typically once a day). Assuming that the user is represented by a smart card, we present here solutions that preserve all advantages of CVTs while relaxing the aforementioned synchronization requirement. If short-validity certificates are used, implicit revocation provided by the proposed solutions completely eliminates the need for the signature verifier to check any revocation information (CRLs, CRTs, etc.).
Mobile Agent Route Protection through Hash%2DBased Mechanisms.

Oblivious Image Watermarking Robust against Scaling and Geometric Distortions.

Watermarking for Multilevel Access to Statistical Databases.
has prompted official statistics to release individual respondent data (microdata) in addition to the traditional tabular data. Microdata must be masked by a statistical disclosure control (SDC) method before being published, because otherwise the statistical confidentiality of respondents would be compromised. A novel application of watermarking is discussed in this paper which allows multilevel access to numerical microdata: depending on her clearance, the data user can remove more or less of the masking. Nonprivileged users just see the published data, but as the clearance of a user increases she can get a data set which is closer and closer to the original one.
Current directions in smart cards.

Smart Card Research and Advanced Applications
This contribution describes how an elliptic curve cryptosystem can be implemented on very low cost microprocessors with reasonable performance. We focus in this paper on the Intel 8051 family of microcontrollers popular in smart cards and other cost-sensitive devices. The implementation is based on the use of the finite field GF ((2  8  -  17)  17  ) which is particularly suited for low end 8-bit processors. Two advantages of our method are that subfield modular reduction can be performed infrequently, and that an adaption of Itoh and Tsujii&#039;s inversion algorithm is used for the group operation. We show that an elliptic curve scalar multiplication with a fixed point, which is the core operation for a signature generation, can be performed in a group of order approximately 2  134  in less than 2 seconds. Unlike other implementations, we do not make use of curves defined  over a subfield such as Koblitz curves.  1  2  Keywords: finite fields, fast arithmetic, Optimal Extension Fields, mo...
A Performance Comparison of Java Cards for Micropayment Implementation.

Spatial%2DDomain Image Watermarking Robust against Compression
Two robust spatial-domain watermarking algorithms for image  copyright protection are described in this paper. The first one is  robust against compression, filtering and cropping. Like all published  crop-proof algorithms, the one proposed here requires the original image  for mark  recovery.R;YIY3kPF  against compression and filtering is obtained  by using the JPEG algorithm to decide on mark location and  magnitude; robustness against cropping is achieved through a repetition  code. The second watermarking algorithm uses visual components and  is robust against compression, filtering, scaling and moderate rotations.
Simple Collusion%2DSecure Fingerprinting Schemes for Images.
This paper describes a robust watermarking algorithm and a collusion-secure fingerprinting scheme based on it. Watermarking robustness is obtained by using the JPEG algorithm to decide mark location and magnitude; the proposed algorithm supports multiple marking. The properties of dual binary Hamming codes are exploited to obtain a fingerprinting scheme secure against collusion of two buyers. The fingerprinting construction proposed here is simpler than previous collusion-secure proposals.
Spending Programs A Tool for Flexible Micropayments.
Micropayments are electronic payments of small amount. Given their low value, the cost...
Anonymous Fingerprinting Based on Committed Oblivious Transfer.
. Thwarting unlawful redistribution of information sold electronically  is a major problem of information-based electronic commerce.  Anonymous ngerprinting has appeared as a technique for copyright protection  which is compatible with buyer anonymity in electronic transactions.  However, the complexity of known algorithms for anonymous ngerprinting  deters their practical implementation, since they rely either  on secure multiparty computation or on general zero-knowledge proofs.  A scheme for anonymous ngerprinting based on committed oblivious  transfer is presented in this paper where all computations can be performed  eciently.  Keywords: Secure electronic commerce, Intellectual property protection,  Anonymous ngerprinting, Committed oblivious transfer.  1 Introduction  In information-based electronic commerce, copyright protection of the information being sold is a key problem to be solved, together with secure payment. Fingerprinting is a technique which allows to track redis...
Efficient Smart%2DCard Based Anonymous Fingerprinting.
Thwarting unlawful redistribution of information sold electronically is a major problem of information-based electronic commerce. Anonymous Fingerprinting...
Untransferable Rights in a Client%2DIndependent Server Environment.

An Anonymous Electronic Commerce Scheme with an Off%2DLine Authority and Untrusted Agents.
In the last years, the exponential growth of computer networks has created an incredibly large offer of products and services in the net. Such a huge amount of information makes it impossible for a single person to analyze all existing offers of a product on the net and decide which of them fits better her requirements. This problem is solved with the intelligent trade agents (ITA), which are programs that have the ability to roam a network, collect business-related data and use them to make decisions to buy goods on their owners &#039; behalf. Known ITA systems do not provide anonymity in transactions, require an on-line trusted third party and implicitly assume that the user trusts the ITA. We present a new scheme for an intelligent untrusted trade agent system allowing anonymous electronic transactions with an off-line trusted third party.  Keywords: Intelligent agents, Electronic commerce, Security and electronic payment, Untraceability, Anonymity.  1 Introduction  In the last years, th...
An implementable scheme for secure delegation of computing and data.
. The need for delegating information arises when the data  owner wants to have her data handled by an external party. If the external  party is untrusted and data are confidential, delegation should  be performed in a way that preserves security. Uses of delegation range  from public administration to smart cards. In this paper, correctness and  security requirements as well as protocols are specified for delegation of  computing and data. A cryptographic solution to the secure delegation  problem is described which provides data confidentiality and computation  verifiability. Finally, an implementation allowing secure delegation  of information over the Internet is briefly discussed.  1 Introduction  In many scenarios, data cannot be processed where they originate or belong to. In such cases, the data owner must transfer data to a remote environment (the handler) for processing. If data are confidential, a security problem arises. A legal solution to this problem is to require that t...
Multi%2DApplication Smart Cards and Encrypted Data Processing.
Some existing approaches to multi-application smart card design rely on the card containing data and importing the code of functions (methods) to be performed on data. A complementary solution is proposed in this paper to relax the requirement| or rather bottleneck|that all condential data and processing be supported by the card. Our approach is based on running some applications outside the card using encrypted data processing, specifically privacy homomorphisms. Examples of privacy homomorphisms are given, one of which is very recent and allows full arithmetic on encrypted data while remaining secure against known-cleartext attacks.
Achieving Rights Untransferability with Client%2DIndependent Servers.
This article presents a scheme for enforcing access rights untransferability in a client-server scenario. Assumptions include a central authority and servers which are trusted and hold no access information about clients. For a client sharing none of her rights, usurpation of a right seems as hard as the discrete logarithm. Also, rights sharing between clients does not compromise their non-shared rights when a sound public-key cryptosystem is used. Transferring rights between clients without the authority&#039;s contribution cannot be done if a sound public-key cryptosystem is used. However, only control on partial rights transfers is addressed in this paper, which does not deal with total identity transfer or alienation.
A New Privacy Homomorphism and Applications.
An additive and multiplicative privacy homomorphism is an encryption function mapping addition and multiplication of cleartext data into two operations on encrypted data. One such privacy homomorphism is introduced which has the novel property of seeming secure against a known-cleartext attack. An application to multilevel statistical computation is presented, namely classified retrieval of exact statistics from unclassified computation on disclosure-protected (perturbed) data.  Keywords: Privacy homomorphisms, statistical confidentiality, safety/security in digital systems. 1 Introduction  Privacy homomorphisms (PHs from now on) were formally introduced in [5] as a tool for processing encrypted data. Basically, they are encryption functions E k : T \Gamma! T  0  which allow to perform a set F  0  of operations on encrypted data without knowledge of the decryption function D k . Knowledge of D k allows to recover the outcome of the corresponding set F of operations on clear data. The s...
Untransferable Rights in a Client%2DIndependent Server Environment.

Algorithm%2D sequenced access control.

Distributed User Identification by Zero%2DKnowledge Access Rights Proving.

A cryptographic tool for programs protection.

Software Run%2DTime Protection A Cryptographic Issue.

Secure network bootstrapping An algorithm for authentic key exchange and digital signitures.

Full Secure Key Exchange and Authentication with no Previously Shared Secrets.

